Minors of the Moore - Penrose Inverse ∗

نویسنده

  • Jianming Miao
چکیده

Let Qk,n = {α = (α1, · · · , αk) : 1 ≤ α1 < · · · < αk ≤ n} denote the strictly increasing sequences of k elements from 1, . . . , n. For α, β ∈ Qk,n we denote by A[α, β] the submatrix of A with rows indexed by α, columns by β. The submatrix obtained by deleting the α-rows and β-columns is denoted by A[α′, β′]. For nonsingular A ∈ IRn×n, the Jacobi identity relates the minors of the inverse A−1 to those of A: detA−1[β, α] = (−1) ∑k i=1 αi+ ∑k i=1 βi detA[α ′, β′] detA for any α, β ∈ Qk,n. We generalize Jacobi’s identity to matrices A ∈ IRm×n r , expressing the minors of the Moore-Penrose inverse A† in terms of the minors of the maximal nonsingular submatrices AIJ of A. In our notation, detA†[β, α] = 1 vol A ∑ (I,J)∈N (α, β) detAIJ ∂ ∂|Aαβ | |AIJ |, for any α ∈ Qk,m , β ∈ Qk,n , 1 ≤ k ≤ r, where vol A denotes the sum of squares of determinants of r × r submatrices of A. This represents the k× k minors of A† as a convex combination of the minors of A. The weights of this combination are, surprisingly, the same for all k. We apply our results to questions concerning the nonnegativity of principal minors of the Moore-Penrose inverse.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

The reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules

Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...

متن کامل

Singular Values and Maximum Rank Minors of Generalized Inverses

Singular values and maximum rank minors of generalized inverses are studied. Proportionality of maximum rank minors is explained in terms of space equivalence. The Moore–Penrose inverse A† is characterized as the {1}–inverse of A with minimal volume.

متن کامل

Hermitian solutions to the system of operator equations T_iX=U_i.

In this article we consider the system of operator equations T_iX=U_i for i=1,2,...,n and give necessary and suffcient conditions for the existence of common Hermitian solutions to this system of operator equations for arbitrary operators without the closedness condition. Also we study the Moore-penrose inverse of a ncross 1 block operator matrix and. then gi...

متن کامل

Binary Moore-Penrose Inverses of Set Inclusion Incidence Matrices

This note is a supplement to some recent work of R.B. Bapat on Moore-Penrose inverses of set inclusion matrices. Among other things Bapat constructs these inverses (in case of existence) forH(s, k) mod p, p an arbitrary prime, 0 ≤ s ≤ k ≤ v − s. Here we restrict ourselves to p = 2. We give conditions for s, k which are easy to state and which ensure that the Moore-Penrose inverse of H(s, k) mod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005